Hierarchical Constraint Satisfaction for Dimensional Inspection Planning
نویسندگان
چکیده
منابع مشابه
Encoding HTN Planning as a Dynamic CSP
Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal is an application of the CSP formalism on hierarchical task network planning domain. An encoding of HTN planning problems as a dynamic CSP is presented. We suppose that such encoding would provide a way for search space reductio...
متن کاملFuzzy rrDFCSP and planning
Constraint satisfaction is a fundamental Artificial Intelligence technique for knowledge representation and inference. However, the formulation of a static constraint satisfaction problem (CSP) with hard, imperative constraints is insufficient to model many real problems. Fuzzy constraint satisfaction provides a more graded viewpoint. Priorities and preferences are placed on individual constrai...
متن کاملHandling uncertainties of robot manipulators and active vision by constraint propagation
Joint errors are inevitable in robot manipulation. These uncertainties propagate to give rise to translational and orientational errors in the position and orientation of the robot end-effector. The displacement of the active vision head mounted on the robot endeffector produces distortion of the projected object on the image. Upon active visual inspection, the observed dimension of a mechanica...
متن کاملSpecial Track on Artificial Intelligence Planning and Scheduling
Planning has belonged to fundamental areas of AI since its beginning and sessions on planning are an integral part of major AI conferences. By generating activities necessary to achieve some goal, planning is also closely related to scheduling that deals with allocation of activities to scarce resources. Although the planning and scheduling communities are somehow separated, both areas have int...
متن کاملPlanning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach
In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchical, temporal, or procedural knowledge to be represented and exploited in parallel, thus combining the ideas of control knowledge in HTN-planning, GOLOG-programming, and planning wit...
متن کامل